Imperative Programs Behavior Simulation in Terms of Compositional Petri Nets
نویسندگان
چکیده
منابع مشابه
Compositional Reachability in Petri Nets
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries: we consider the algebraic decomposition of the net of interest as part of the input. We formally prove the correctness of the technique and contrast the performance of our implementation with state-o...
متن کاملCompositional Analysis of Discrete Time Petri nets
Symbolic BDD-based verification techniques successfully tackle combinatorial explosion in many cases. However, the models to be verified become increasingly larger and more complex, including for instance additional features like quantitative requirements and/or a very high number of components. The need to improve performances for verification tools thus remains a challenge. In this work, we e...
متن کاملCompositional time Petri nets and reduction rules
This paper introduces compositional time Petri net (CTPN) models. A CTPN is a modularized time Petri net (TPN), which is composed of components and connectors. The paper also proposes a set of component-level reduction rules for TPNs. Each of these reduction rules transforms a TPN component to a very simple one while maintaining the net's external observable timing properties. Consequently, the...
متن کاملPeCAn: Compositional Verification of Petri Nets Made Easy
This paper introduces PeCAn, a tool supporting compositional verification of Petri nets. Beyond classical features (such as onthe-fly analysis and synchronisation between multiple Petri nets), PeCAn generates Symbolic Observation Graphs (SOG), and uses their composition to support modular abstractions of multiple Petri nets for more efficient verification. Furthermore, PeCAn implements an incre...
متن کاملCompositional model checking of concurrent systems, with Petri nets
Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour. Process equivalence means that the explicit statespace of a system takes a back seat to its interaction patterns: the information that an environment can obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2018
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2018.10107